Degree limited polynomial in Reed-Solomon decoding

ABSTRACT

Processing Reed Solomon data is disclosed. A scratch polynomial having a degree is obtained using an inversionless Berlekamp-Massey process. The degree of the scratch polynomial is limited. A magnitude of an error associated with the Reed Solomon data is determined based at least in part on information associated with the degree limited scratch polynomial. In some embodiments, determining the magnitude of an error using the degree limited scratch polynomial enables a smaller device.

BACKGROUND OF THE INVENTION

Reed-Solomon codes are used in a variety of applications including optical and magnetic storage devices, satellite communications, and compact disk recording. In some of these applications, Reed-Solomon codes are implemented as a hardware device, such as an Application Specific Integrated Circuit (ASIC) or a Field Programmable Gate Array (FPGA). The decoder is typically much larger and more computation intensive than the encoder. In hardware and non-hardware implementations, improved Reed-Solomon decoders (for example, with reduced hardware or reduced latency) may be useful to systems that employ such devices.

BRIEF DESCRIPTION OF THE DRAWINGS

Various embodiments of the invention are disclosed in the following detailed description and the accompanying drawings.

FIG. 1 is a diagram illustrating an embodiment of a Reed-Solomon decoder.

FIG. 2 is a diagram illustrating an embodiment of an rIBMM system.

FIG. 3 is a system illustrating an embodiment of an rPCSEE system.

FIG. 4A is a processing diagram illustrating an embodiment of generation of discrepancy values.

FIG. 4B is a processing diagram illustrating an embodiment of the parallel inversionless Berlekamp-Massey method.

FIG. 5A is a diagram illustrating a modular PIBMM system.

FIG. 5B is a diagram illustrating a processor element (PE) used in a PIBMM system.

FIG. 6A is a diagram illustrating a modular rPIBMM system.

FIG. 6B is a diagram illustrating a processor element (PE) used in an rPIBMM system.

FIG. 7 is a table illustrating implementation costs and critical path delays of some embodiments of methods used in Reed Solomon decoding.

DETAILED DESCRIPTION

The invention can be implemented in numerous ways, including as a process, an apparatus, a system, a composition of matter, a computer readable medium such as a computer readable storage medium. In this specification, these implementations, or any other form that the invention may take, may be referred to as techniques. A component such as a processor or a memory described as being configured to perform a task includes both a general component that is temporarily configured to perform the task at a given time or a specific component that is manufactured to perform the task. In general, the order of the steps of disclosed processes may be altered within the scope of the invention.

A detailed description of one or more embodiments of the invention is provided below along with accompanying figures that illustrate the principles of the invention. The invention is described in connection with such embodiments, but the invention is not limited to any embodiment. The scope of the invention is limited only by the claims and the invention encompasses numerous alternatives, modifications and equivalents. Numerous specific details are set forth in the following description in order to provide a thorough understanding of the invention. These details are provided for the purpose of example and the invention may be practiced according to the claims without some or all of these specific details. For the purpose of clarity, technical material that is known in the technical fields related to the invention has not been described in detail so that the invention is not unnecessarily obscured.

Various embodiments of scalable Very large scale integration (VLSI) architectures for Reed-Solomon decoders with the Berlekamp-Massey method are disclosed. The illustrated decoders may use an inversionless Berlekamp-Massey method using the Horiguchi-Koetter formula for error evaluation. The described error evaluation may eliminate computation of an error evaluator polynomial so that t cycles are eliminated, where t is the error correction capability of the code. Using a dynamic stopping rule, t registers and shift operators in the Berlekamp-Massey method and t registers and multipliers in the error evaluation are eliminated in some embodiments. A parallel inversionless Berlekamp-Massey method that may use less hardware than some other methods is also disclosed. Parallel methods and devices may be preferred in applications where latency is a concern. In some embodiments, 4t+2 multipliers and registers are used in a system of the parallel method, compared to 6t+2 multipliers and registers used in a system that implements another type of a parallel inversionless Berlekamp-Massey method, and 8t+8 multipliers and 4t+4 registers used by a system of an extended Euclidean method. In some embodiments, devices of the described architecture are power efficient because of reduced hardware and reduced processing time.

Reed-Solomon codes are used in a variety of applications. Storage devices use Reed-Solomon decoders to correct data read from the storage medium. Storage devices may be read-only or read-write and include magnetic storage, barcodes, and DVD. Wireless communication devices use Reed-Solomon decoders in their receivers to correct for errors over the wireless channel. Similarly, wired transceivers such as high speed modems and digital televisions use Reed-Solomon codes to correct for errors introduced during transmission over the communication channel. Other applications besides those described above may use a Reed-Solomon decoder as described herein.

FIG. 1 is a diagram illustrating an embodiment of a Reed-Solomon decoder. In the example shown, for a Reed-Solomon C(n,k) code over a Galois Field of GF(p^(m)), a k-symbol data word D

[D_(k−1), D_(k−2), . . . , D₁, D₀] is encoded to produce an n-symbol codeword C

[C_(n−1), C_(n−2), . . . , C₁, C₀]. Another way of expression this is that a data word polynomial D(x)=D_(k−1)x^(k−1)+D_(k−2)x^(k−2)+ . . . +D₁x¹+D₀ is encoded to produce a codeword polynomial C(x)=C_(n−1)x^(n−1)+C_(n−2)x^(n−2)+ . . . +C₁x+C₀, by means of a generator polynomial

${{G(x)} = {\prod\limits_{i = 0}^{{\Delta\; n} - k - 1}\;\left( {x - a^{m_{0} + i}} \right)}},$ where m₀ is typically 0 or 1 and α is a primitive element of GF(p^(m)). As used herein, vector A=[A₀, A₁, A₂, . . . , A_(l)] and its polynomial representation A(x)=A₀+A₁x+A₂x²+ . . . A_(l)x^(l) may be used interchangeably. In some embodiments, a polynomial of degree less than n is a codeword polynomial if and only if it is a multiple of the generator polynomial, G(x). A codeword polynomial C(x) satisfies C(α^(m) ⁰ ^(+i))=0, i=0, 1, 2, . . . , n−k−1.

The minimum Hamming distance of the code is d_(min)=n−k+1, a feature known as maximally-distance-separable. For purposes of illustration, the examples described herein consider the specific case where p=2 (i.e., GF(2^(m))), instead of the general case where GF(p^(m)), and m₀=1. In other words, the code illustrated in this embodiment is defined such that n−k=2t (where t is the error-correction capability). Although examples described herein consider the above specific case, in some embodiments, other cases may be used.

A systematic encoding generates a codeword that is comprised of the data word and parity-check symbols. To generate a codeword, let Ψ(x)

Ψ_(2t−1)x^(2t−1)+Ψ_(2t−2)x^(2t−2)+ . . . +Ψ₁x+Ψ₀ denote the remainder when x^(2t)D(x) is divided by G(x). The polynomial x^(2t)D(x)−Ψ(x) is then a multiple of G(x) and is denoted as a systematic codeword polynomial; alternatively, C=[D_(k−1), D_(k−2), . . . , D₀, −Ψ_(2t−1), −Ψ_(2t−2), . . . , −Ψ₀].

Let C(x) denote the transmitted codeword polynomial and R(x) the received word polynomial after appropriate channel quantization. The received word polynomial, R(x), is passed to decoder 100 and may include some errors. The decoding objective is to determine the error polynomial E(x) such that C(x)=R(x)−E(x). That is, decoder 100 attempts to produce the original codeword, C(x), using the received polynomial, R(x).

Syndrome generator 102 generates syndrome values using the received polynomial, R(x). Syndrome values are computed using: S _(i) =R(α^(i+1))=c(α^(i+1))+E(α^(i+1))=E(α^(i+1)), =0, 1, 2, . . . , 2t−1. If all 2t syndrome values are zero, then R(x) is a codeword and it may be assumed that C(x)=R(x), i.e., no errors have occurred. Otherwise, the decoder attempts to solve the following equation system:

$\left\{ \begin{matrix} {{{Y_{1}X_{1}^{1}} + {Y_{2}X_{2}^{1}} + \ldots + {Y_{e}X_{e}^{1}}} = S_{0}} \\ {{{Y_{1}X_{1}^{2}} + {Y_{2}X_{2}^{2}} + \ldots + {Y_{e}X_{e}^{2}}} = S_{1}} \\ {\mspace{301mu}\vdots} \\ {{{Y_{1}X_{1}^{2t}} + {Y_{2}X_{2}^{2t}} + \ldots + {Y_{e}X_{e}^{2t}}} = S_{{2t} - 1}} \end{matrix} \right.$ where e denotes the (unknown) number of errors, X₁, X₂, . . . , X_(e) denote the error locations, and Y₁, Y₂, . . . , Y_(e) denote the corresponding error magnitudes.

The syndrome polynomial generated by syndrome generator 102 is defined to be: S(x)

S ₀ +S ₁ x+S ₂ x ² + . . . +S _(2t−1) x ^(2t−1).   (1)

The syndromes (i.e., the coefficients of the syndrome polynomial) are passed from syndrome generator 102 to error polynomial generator 104. Error polynomial generator 104 generates the error locator polynomial, Λ(x), which is defined to be:

$\begin{matrix} {{{\Lambda(x)}{\prod\limits_{i = 1}^{e}\;\left( {1 - {X_{i}x}} \right)}} = {1 + {\Lambda_{1}x} + {\Lambda_{2}x^{2}} + \ldots + {\Lambda_{e}{x^{e}.}}}} & (2) \end{matrix}$

The error evaluator polynomial is defined to be:

$\begin{matrix} {{{\Omega(x)}{\sum\limits_{i = 1}^{e}{Y_{i}X_{i}{\sum\limits_{{j = 1},{j \neq i}}^{e}\left( {1 - {X_{j}x}} \right)}}}} = {\Omega_{0} + {\Omega_{1}x} + {\Omega_{2}x^{2}} + \ldots + {\Omega_{e - 1}{x^{e - 1}.}}}} & (3) \end{matrix}$

The three polynomials satisfy the following equation: Ω(x)=Λ(x)S(x) (mod x ^(2t)).   (4)

Both the Berlekamp-Massey method and the extended Euclidean method can be used to solve equation 4, given that the number of errors e does not exceed the error-correction capability t. In particular, both the Berlekamp-Massey method and the extended Euclidean method may be used in error polynomial generator 104 to generate the error locator polynomial Λ(x). Additional polynomials besides the error locator polynomial may be generated by error polynomial generator 104.

Embodiments illustrated herein consider parallel and non-parallel inversionless Berlekamp-Massey methods. Although the embodiments and examples illustrated describe particular decoder scenarios, the methods and techniques illustrated may be applied to other cases.

Example pseudo code for an Inversionless Berlekamp-Massey Method (IBMM) follows.

-   -   Input: S=[S₀, S₁, S₂, . . . , S_(2t−1)]     -   Initialization: Λ⁽⁰⁾(x)=1, B⁽⁰⁾(x)=1, γ⁽⁰⁾=1, and L=0     -   For r=0, 1, 2, . . . , 2t−1, do:         -   Compute Δ^((r))=Σ_(i=0) ^(L)Λ_(i) ^((r))·S_(r−i)         -   Compute Λ^((r+1))(x)=γ^((r))·Λ^((r))(x)−Δ^((r))·xB^((r))(x)         -   If Δ^((r))≠0 and 2L≦r, then             -   Set B^((r+1))(x)←Λ^((r))(x) and L←r+1−L             -   Set γ^((r+1))←Δ^((r))         -   Else             -   Set B^((r+1))(x)←xB^((r))(x)             -   Set γ^((r+1))←γ^((r))         -   endif     -   endfor     -   Output: Λ=[Λ₀ ^((2t)), Λ₁ ^((2t)), Λ₂ ^((2t)), . . . , Λ_(t)         ^((2t))], γ=γ^((2t)), L B=[B₀ ^((2t)), B₁ ^((2t)), B₂ ^((2t)), .         . . , B_(2t−1) ^((2t))]

where superscript ^((r)) indicates the R-th iteration and subscript _(i) indicates the i-th coefficient.

The error locator polynomial, Λ(x), is passed from error polynomial generator 104 to error locator 106. Error locations may correspond to the roots, X_(i), of the error locator polynomial, Λ(x). Error locator 106 may use a Chien search method to determine error locations.

Error evaluator 108 determines the error magnitudes, Y_(i). Error locations are received from error locator 106 and are used to determine the error magnitudes. Some Reed Solomon decoders use the Forney formula to determine the error magnitudes. Other error magnitude formulas besides the Forney formula may be determined and used to generate the error magnitudes. For example, error magnitudes formulas that allow reduced hardware or reduced clock cycles may be preferred. In some embodiments, the error magnitude formula may allow improvements in other blocks besides the error evaluator. For example, using some error magnitude formulas, error polynomial generator 104 or error locator 106 may also be improved.

Error corrector 110 uses the error magnitudes and error locations to correct the received polynomial, R(x). If the error correction capability of the code is able to correct for the received errors, E(x), then the output of error corrector 110 is C(x), the codeword originally transmitted.

Some properties of the Berlekamp-Massey method are characterized in the following lemmas.

Lemma 1

The degrees of B^((r))(x) and Λ^((r))(x) obtained during the Berlekamp-Massey iterations satisfy: deg(b ^((r)))+deg(Λ^((r)))=r, 0≦r≦2t.   (5)

The proof may be shown by induction.

Lemma 2

(i). The degree of B(x) may be as high as 2t−1.

(ii). Ignoring zeros, the degree of B(x) is at most t−1.

(iii). If at the r-th (r<2t) iteration B^((r))(x) has degree t−1, then, either more than t errors have occurred (i.e., uncorrectable), or Λ^((r+1))(x) contains all error locations.

Proof of (i): In the worst case scenario there is one symbol error, accordingly the degree of Λ(x) is 1. Lemma 1 implies that the degree of B(x) is 2t−1.

Proof of (ii): When L=deg(Λ)>t, according to Lemma 1, deg(B)=2t−deg(Λ)≦t−1; when L=deg(Λ)≦t, the Berlekamp-Massey iteration indicates that B(x) is right-shifted polynomial of a preceding Λ^((2t))(x)=Λ(x) that has a smaller degree than Λ(x), then deg(B)<deg(Λ)≦t.

Proof of (iii): If at most t errors have occurred, then all error locations are the all roots of Λ^((2t))(x), which implies that the degree of Λ^((2t))(x) is at most t. If r=2t−1, then the conclusion holds. Next, consider the case of r<2t−1. Let L^((r)) be the degree of Λ^((r))(x). Let r′>r the be smallest number such that at Δ^((r′))≠0, then r′−2L ^((r)) =r′−2r+2(r−L ^((r)))=r′−2r+2(t−1)>0, where r−L^((r)) represents the degree of B^((r))(x). L^((r′+1)) is updated by r′+1−L ^((r)) =r′+1−r+(r−L ^((r)))≦r′+1−r+(t−1)>t. This conflicts with the conclusion that deg(Λ^((r′+1)))≦deg(Λ^((2t)))≦t. Thus, all subsequent discrepancies Δ^((r+1)), Δ^((r+2)), . . . , Δ^((2t−1)) are all zeros, and therefore Λ^((r+1))(x) differs from Λ^((2t))(x) by a scalar factor. Lemma 2 is therefore proven.

Once given the error locator polynomial Λ(x), its roots (which indicate the error locations), may be obtained through a Chien search. The corresponding error magnitudes may be obtained from the Forney formula:

$\begin{matrix} {{Y_{i} = \frac{\Omega\left( X_{i}^{- 1} \right)}{X_{i}^{- 1}{\Lambda^{\prime}\left( X_{i}^{- 1} \right)}}},{i = 1},2,\ldots\mspace{14mu},{e.}} & (6) \end{matrix}$ However, this approach performs the computation of Ω(x)=Λ(x)S(x) (mod x^(2t)), which takes t additional cycles after the Chien search has found the error locations and may not be desirable compared to methods that do not use Ω(x). Lemma 3 defines an error evaluation approach that avoids the computation of Ω(x).

Lemma 3

(i) Given the inversionless Berlekamp-Massey iteration in the form

$\begin{matrix} {\begin{bmatrix} \Lambda^{({r + 1})} & (x) \\ B^{({r + 1})} & (x) \end{bmatrix} = {\begin{bmatrix} \gamma^{(r)} & {{- \Delta^{(r)}}x} \\ \delta & {\left( {1 - \delta} \right)x} \end{bmatrix}\begin{bmatrix} \Lambda^{(r)} & (x) \\ B^{(r)} & (x) \end{bmatrix}}} & (7) \end{matrix}$ with the initial conditions Λ⁽⁰⁾(x)=1, B ⁽⁰⁾(x)=1, γ⁽⁰⁾=1 where δ∈{0,1} is dependent of each iteration and γ^((r+1))=γ^((r))(1−δ)+Δ^((r))δ,   (8) then Ω^((r))(x)B ^((r))(x)−Λ^((r))(x)θ^((r))(x)=γ^((r))Λ₀ ^((r)) x ^(r)   (9) where Ω^((r))(x)

Λ^((r))(x)S(x)mod x ^(r), θ^((r))(x)

B ^((r))(x)xS(x)−x′ mod x ^(r+1) (by definition Ω⁽⁰⁾(x)=0 and θ⁽⁰⁾(x)=−1).

(ii) The error magnitude of a given error location is given by

$\begin{matrix} {{{Y_{i} = \frac{{\gamma\Lambda}_{0}X_{i}^{- {({{2t} - 1})}}}{{B\left( X_{i}^{- 1} \right)}{\Lambda^{\prime}\left( X_{i}^{- 1} \right)}}},{i = 1},2,\ldots\mspace{14mu},{e.}}\;} & (10) \end{matrix}$

Proof of (i): By induction:

${\begin{bmatrix} {\Omega^{({r + 1})}(x)} \\ {\theta^{({r + 1})}(x)} \end{bmatrix} = {{\begin{bmatrix} \gamma^{(r)} & {{- \Delta^{(r)}}x} \\ \delta & {\left( {1 - \delta} \right)x} \end{bmatrix}\begin{bmatrix} {\Omega^{(r)}(x)} \\ {\theta^{(r)}(x)} \end{bmatrix}}.}}\;$ When r=1, Λ⁽¹⁾(x)=1−S₀x, B⁽¹⁾(x)=δ+(1−δ)x which is 1 when Δ⁽⁰⁾=S₀ is zero, or x otherwise. The above equality with respect to Ω⁽¹⁾(x) and θ⁽¹⁾(x) is verified in the following

$\begin{matrix} {{\Omega^{(1)}(x)} = {{{\Lambda^{(1)}(x)} \cdot {{xS}(x)}}{mod}\; x^{2}}} \\ {= {S_{0}x}} \\ {{= {{\gamma^{(0)} \cdot {\Omega^{(0)}(x)}} - {{\Delta^{(0)} \cdot x}\;{{\theta^{(0)}(x)}.}}}}\;} \\ {{\theta^{(1)}(x)} = {{{{B^{(1)}(x)} \cdot x}\;{S(x)}} - {xmodx}^{2}}} \\ {= \left\{ \begin{matrix} 0 & {{{if}\mspace{14mu} S_{0}} \neq 0} \\ {- x} & {{{if}\mspace{14mu} S_{0}} = 0} \end{matrix} \right.} \\ {{= {{\delta \cdot {\Omega^{(0)}(x)}} + {{\left( {1 - \delta} \right) \cdot x}\;{\theta^{(0)}(x)}{{modx}^{2}.}}}}\;} \end{matrix}$

Suppose that it is true for r up to K, then, we have for r=K+1,

$\begin{matrix} {\begin{bmatrix} {\Omega^{({K + 1})}(x)} \\ {\theta^{({K + 1})}(x)} \end{bmatrix} = {\begin{bmatrix} {{\Lambda^{({K + 1})}(x)}{{xS}(x)}} \\ {{{B^{({K + 1})}(x)}{{xS}(x)}} - x^{K + 1}} \end{bmatrix}\left( {{mod}\; x^{K + 2}} \right)}} \\ {= {{\begin{bmatrix} \gamma^{(K)} & {{- \Delta^{(K)}}x} \\ \delta & {\left( {1 - \delta} \right)x} \end{bmatrix} \cdot \begin{bmatrix} {{\Lambda^{(K)}(x)}{{xS}(x)}} \\ {{B^{(K)}(x)}{{xS}(x)}} \end{bmatrix}} - {\begin{bmatrix} 0 \\ x^{K + 1} \end{bmatrix}\left( {{mod}\; x^{K + 2}} \right)}}} \\ {= {{\begin{bmatrix} \gamma^{(K)} & {- \Delta^{(K)}} \\ \delta & \left( {1 - \delta} \right) \end{bmatrix} \cdot \begin{bmatrix} {{\Lambda^{(K)}(x)}{{xS}(x)}} \\ {{B^{(K)}(x)}x^{2}{S(x)}} \end{bmatrix}} - {\begin{bmatrix} 0 \\ x^{K + 1} \end{bmatrix}\left( {modx}^{K + 2} \right)}}} \\ {= {{\begin{bmatrix} \gamma^{(K)} & {- \Delta^{(K)}} \\ \delta & \left( {1 - \delta} \right) \end{bmatrix} \cdot \begin{bmatrix} {{\Omega^{(K)}(x)} + {\Delta^{(K)}x^{K + 1}}} \\ {x\left( {{\theta^{(K)}(x)} + x^{K}} \right)} \end{bmatrix}} - \begin{bmatrix} 0 \\ x^{K + 1} \end{bmatrix}}} \\ {= {\begin{bmatrix} \gamma^{(K)} & {{- \Delta^{(K)}}x} \\ \delta & {\left( {1 - \delta} \right)x} \end{bmatrix} \cdot {\begin{bmatrix} {\Omega^{(K)}(x)} \\ {\theta^{(K)}(x)} \end{bmatrix}.}}} \end{matrix}$

Thus, the following single iteration rule is obtained:

$\begin{bmatrix} {\Omega^{({r + 1})}(x)} & {\Lambda^{({r + 1})}(x)} \\ {\theta^{({r + 1})}(x)} & {B^{({r + 1})}(x)} \end{bmatrix} = {\begin{bmatrix} \gamma^{(K)} & {- {\Delta^{(K)}(x)}} \\ \delta & {\left( {1 - \delta} \right)x} \end{bmatrix} \cdot \begin{bmatrix} {\Omega^{(r)}(x)} & {\Lambda^{(r)}(x)} \\ {\theta^{(r)}(x)} & {B^{(r)}(x)} \end{bmatrix}}$

Equation (9) may be shown by induction. When r=1,

$\begin{matrix} {{{{\Omega^{(1)}(x)}{B^{(1)}(x)}} - {{\Lambda^{(1)}(x)}{\theta^{(1)}(x)}}} = {\begin{matrix} {\Omega^{(1)}(x)} & {\Lambda^{(1)}(x)} \\ {\theta^{(1)}(x)} & {B^{(1)}(x)} \end{matrix}}} \\ {= {{\begin{matrix} \gamma^{(0)} & {{- \Delta^{(0)}}x} \\ \delta & {\left( {1 - \delta} \right)x} \end{matrix}} \cdot {\begin{matrix} {\Omega^{(0)}(x)} & {\Lambda^{(0)}(x)} \\ {\theta^{(0)}(x)} & {B^{(0)}(x)} \end{matrix}}}} \\ {= {\left\lbrack {{\gamma^{(0)}\left( {1 - \delta} \right)} + {\Delta^{(0)}\delta}} \right\rbrack \cdot x}} \\ {{= {\gamma^{(1)}\Lambda_{0}^{(1)}x}},} \end{matrix}$ where the last equality is due to Equation (8) and Λ₀ ⁽¹⁾=1. Suppose it is true for r=K, then for r=K+1:

$\begin{matrix} {{{{\Omega^{({K + 1})}(x)}{B^{({K + 1})}(x)}} - {{\Lambda^{({K + 1})}(x)}{\theta^{({K + 1})}(x)}}} = {\begin{matrix} {\Omega^{({K + 1})}(x)} & {\Lambda^{({K + 1})}(x)} \\ {\theta^{({K + 1})}(x)} & {B^{({K + 1})}(x)} \end{matrix}}} \\ {= {{{\begin{matrix} \gamma^{(K)} & {{- \Delta^{(K)}}x} \\ \delta & {\left( {1 - \delta} \right)x} \end{matrix}} \cdot \gamma^{(K)}}\Lambda_{0}^{(K)}x^{K}}} \\ {{= {\gamma^{({K + 1})}\Lambda_{0}^{({K + 1})}x^{K}}},} \end{matrix}$ where the last equality is due to Equation (8) and Λ₀ ^((K+1))=Λ₀ ^((K))γ^((K)). Part (i) is thus proved.

Part (ii) may be proved using a combination of the Forney formula given by Equation (6) and the result of Part (i) Equation (9), in conjunction with Λ(X⁻¹)=0. Lemma 3 is proven.

δ_(i) is set to 1 if i is odd or 0 otherwise. Also, by separating the evaluation of the odd-power terms and the even-power terms of Λ(x), the evaluation of the odd-power terms is the value of its derivative, which will be used for error evaluation, due to:

$\begin{matrix} {{\Lambda^{\prime}(x)} = {\Lambda_{1} + {2\Lambda_{2}x} + {3\Lambda_{3}x^{2}} + \ldots + {t\;\Lambda_{t}x^{t - 1}}}} \\ {= {\Lambda_{1} + {\Lambda_{3}x^{2}} + {\Lambda_{5}x^{4}} + \ldots + {\Lambda_{t + \delta_{t} - 1}{x^{t + \delta_{t} - 2}.}}}} \end{matrix}$

Thus, the computation of error magnitudes can be simplified further to be

$\begin{matrix} {{Y_{i} = \frac{{\gamma\Lambda}_{0}X_{i}^{- {({2t})}}}{{B\left( X_{i}^{- 1} \right)}{\Lambda_{odd}\left( X_{i}^{- 1} \right)}}},{i = 1},2,\ldots\mspace{11mu},e,} & (11) \end{matrix}$

where Λ_(odd)(X_(i) ⁻¹) can be obtained during the Chien search.

Example pseudo code for a Parallel Chien Search and Error Evaluation (PCSEE) follows. For example, the pseudo code may be used to implement error locator 106 and error evaluator 108.

-   -   Input: Λ=[Λ₀, Λ₁, Λ₂, . . . , Λ_(t)], γ, L B=[B₀, B₁, B₂, . . .         , B_(2t−1)]     -   Initialization: X=Z=1, γ_(i)=Λ_(i), i=0, 1, 2, . . . , t         b_(i)=B_(i), i=0, 1, 2, . . . , 2t−1     -   For j=0, 1, 2, . . . , n, do:         -   Compute Λ_(odd)=λ₁+λ₃+λ₅+ . . . +λ_(t+δ) _(t) ⁻¹         -   Set λ_(i)←λ_(i)·α^(−i+1), i=1, 3, . . . , t+δ_(t)−1         -   Compute Λ_(even)=λ₀+λ₂+λ₄+ . . . +λ_(t−δ) _(t)         -   Set λ_(i)←δ_(i)·α^(−i), i=2, 4, . . . , t−δ_(t)         -   Compute B=b₀+b₁+b₂+ . . . +b_(2t−1)         -   Set b_(i)←b_(i)·α⁻¹, i=1, 2, . . . , 2t−1         -   If Λ_(even)=Λ_(odd), then compute Y=(BΛ_(odd))⁻¹γΛ₀z and             store j, Y         -   Set Z←Z·α^(−2t)     -   endfor     -   Output: [j₁, j₂, . . . , j_(L)], [Y₁, Y₂, . . . , Y_(L)]         The example IBMM may be coupled to the example PCSEE since the         outputs of the IBMM match the inputs of the PCSEE. Syndromes may         be input to the coupled IBMM and PCSEE and the error locations         may be output.

In some embodiments, the Berlekamp-Massey method may use a dynamic stopping rule. Using a dynamic stopping rule, the iterative Berlekamp-Massey method may terminate in less than 2t clock cycles compared to the example Berlekamp-Massey pseudo code that uses 2t iterations.

When the number of errors e is less than t, the degree of Λ(x), L=e. Then, Lemma 1 implies that the degree of B(x) is 2t−e>t. It is shown in the following lemma that in such cases it is possible to terminate the Berlekamp-Massey iteration earlier while limiting the degree of B(x) to t−1 without performance degradation.

Lemma 4: Given the number of errors e≧t,

(i). B^((t+e−1))(x) has degree t−1, and the error locations X_(i) ⁻¹, i=1, 2, . . . , e, are the all roots of Λ^((t+e))(x).

(ii). The error magnitudes are determined by:

$\begin{matrix} {{Y_{i} = \frac{\gamma^{({t + e - 1})}{\Lambda_{0}^{({t + e})} \cdot X_{i}^{{- t} - e + 2}}}{{{B^{({t + e - 1})}\left( x_{i}^{- 1} \right)} \cdot \left\lbrack \Lambda^{({t + e})} \right\rbrack^{\prime}}\left( X_{i}^{- 1} \right)}},{i = 1},2,\ldots\mspace{11mu},{e.}} & (12) \end{matrix}$

The conclusions hold for e=t. Proofs are shown for the case e<t.

Proof of (i): After 2e iterations, the degree of Λ^((2e))(x) is e and Λ^((2e))(x) contains all error locations. Lemma 1 indicates that the degree of B^((2e))(x) is e as well. From the (2e+1)^(th) iteration to the (2t)^(th), the discrepancy values are zero and Λ^((r))(x), for r=2e+1,2e+2, . . . , 2t, are unchanged ignoring a scalar factor. Therefore, at the t+e−1^(th) iteration, the degree of B^((t+e=1))(x) is t+e−1−deg(Λ^((t+e−1)))=t−1. On the other hand, Λ^((t+e))(x) differs from Λ^((2e))(x) by a scalar factor and thus contains the all error locations.

The proof of (ii) follows from Lemma 3 (i). Lemma 4 is proved.

In view of the above Lemmas 2 (iii) and 4, one embodiment of a revised inversionless Berlekamp-Massey method results.

A pseudo code embodiment of a Revised Inversionless Berlekamp-Massey Method (rIBMM) follows.

-   -   Input: S=[S₀, S₁, S₂, . . . , S_(2t−1)]     -   Initialization: Λ⁽⁰⁾(x)=1, B⁽⁰⁾(x)=1, γ⁽⁰⁾=1, z=α, and L=0     -   For r=0, 1, 2, . . . , 2t−1, do:         -   Set z←z·α⁻¹         -   Compute Δ^((r))=Σ_(i=0) ^(L)Λ_(i) ^((r))·S_(r−i)         -   Compute Λ^((r+1))(x)=γ^((r))·Λ^((r))(x)−Δ^((r))·xB^((r))(x)         -   If Δ^((r))≠0 and 2L≦r, then             -   Set B^((r+1))(x)←Λ^((r))(x) and L←r+1−L             -   Set γ^((r+1))←Δ^((r))         -   Else             -   If r−L=t−1 then terminate             -   Else set B^((r+1))(x)←xB^((r))(x), γ^((r+1))←γ^((r))         -   endif     -   endfor     -   Output: Λ=[Λ₀ ^((r+1)), Λ₁ ^((r+1)), Λ₂ ^((r+1)), . . . , Λ_(t)         ^((r+1))], γ=γ^((r)), L B=[B₀ ^((r)), B₁ ^((r)), B₂ ^((r)), . .         . , B_(t−1) ^((r))], z

The described rIBMM embodiment may enable power to be saved dynamically. Note that there is a dynamic stopping rule to terminate when the condition r−L=t−1 is satisfied. In some cases, when the average number of errors is much less than t, the power consumption may be reduced to almost half. Correspondingly, the number of iterations used for the rIBMM embodiment may be less than the example IBMM. The loop of the example IBMM uses 2t iterations, whereas the loop of the rIBMM embodiment may use less than 2t iterations.

FIG. 2 is a diagram illustrating an embodiment of an rIBMM system. In the example illustrated, the system may perform the process described by the pseudo code embodiment of the rIBMM system. As shown in the pseudo code, syndromes are input and Λ, γ, L, B, and z are output. The discrepancy computation block 200 uses t+1 multipliers, t adders, and 2t registers, ignoring miscellaneous other circuitry in the control (such as counters, arithmetic adder or ring counter, OR gates, latches, etc.). Its critical path has 1 multiplier and ┌log₂(t+1)┐ adders, if t additions are computed via a binary tree structure.

Error locator update block 202 uses 2t+1 multipliers t+1 adders, 2t+1 latches (t+1 latches for Λ(x) and t latches for B(x)), and t multiplexers. 2t+1 multipliers are used since the update of Λ₀ uses one multiplier while the update of each of the remaining t terms Λ₁, Λ₂, . . . , Λ_(t), uses two multipliers. The critical path of the error locator update block contains one multiplier and one adder. The separate loop logic of z is used in error evaluation. Control signal MC stands for the Boolean operation “Δ^((r))≠0 and 2r≦L”. B(x), corresponding to the B_(i) values, may be referred to as the scratch polynomial.

The rIBMM system illustrated contains 3t+2 multipliers, 2t+1 adders, 2t+1 latches, and t multiplexers. The critical path delay of the rIBMM system is determined by T _(crit-path)=2T _(mult)+(1+┌log₂(t+1)┐)·t _(add). (  13)

In some embodiments, a revised parallel Chien search and error evaluation is used with the described rIBMM. For example, the outputs of a rIBMM system may be passed to a revised parallel Chien search and error evaluation system. The illustrated rIBMM may be used for error polynomial generator 104 and the revised parallel Chien search and error evaluation are used for error locator 106 and error evaluator 108.

A pseudo code embodiment of a Revised Parallel Chien Search and Error Evaluation (rPCSEE) follows.

-   -   Input: Λ=[Λ₀, Λ₁, Λ₂, . . . , Λ_(t)], γ, L B=[B₀, B₁, B₂, . . .         , B_(t−1)], z     -   Initialization: Z=γ, λ_(i)=Λ_(i), i=0, 1, 2, . . . , t         b_(i)=B_(i), i=0, 1, 2, . . . , t−1     -   For j=0, 1, 2, . . . , n, do:         -   if j=0 then set Z←Z·Λ₀, else set Z←Z·z         -   Compute Λ_(odd)=λ₁+λ₃+λ₅+ . . . +λ_(t+δ) _(t) ⁻¹         -   Set λ_(i)←λ_(i)·α^(−i+1), i=1, 3, 5, . . . , t+δ_(t)−1         -   Compute Λ_(even)=λ₀+λ₂+λ₄+ . . . +λ_(t−δ) _(t)         -   Set λ_(i)←λ_(i)·α⁻¹, i=2, 4, . . . , t−δ_(t)         -   Compute B=b₀+b₁+b₂+ . . . +b_(t−1)         -   Set b_(i)←b_(i)·α^(−i), i=1, 2, . . . , t−1         -   If Λ_(odd)=Λ_(even), then compute Y=(BΛ_(odd))⁻¹Z and store             j, Y     -   endfor     -   Output: [j₁, j₂, . . . , j_(L)], [Y₁, Y₂, . . . , Y_(L)]

As illustrated in the pseudo codes for the PCSEE and rPCSEE, B(x) has a maximum degree of 2t−1 in the former case, compared to t−1 in the latter, which may result in reduced hardware. In some cases, reduced hardware may correspond to reduced manufacturing expenses or reduced power consumption.

FIG. 3 is a system illustrating and embodiment of an rPCSEE system. In the example shown, t is an even number. “MC” is denoted by clock cycles, which indicate the index of a root (i.e., an error location). The evaluation of Λ′(x), Λ(x), B(x) in the illustrated figure use half-multipliers (i.e., one input end of the multiplier is fixed) whose complexity may be roughly one third that of a full-multiplier. By setting γ to the initial value of the loop logic and multiplying Λ₀ in the first iteration (which is otherwise a null operation), the computation of γΛ₀z^(i) is effectively achieved with one full-multiplier and one multiplexer, whereas other implementations may use three full-multipliers. In total, the rPCSEE system uses 2t−1 half-multipliers, 3 full-multipliers, 1 inverter, 2t−2 adders, and 2t+3 latches/registers. The error evaluator polynomial Ω(x) has the same degree bound as B(x). In some embodiments, the hardware complexity of the illustrated rPCSEE system is comparable to the PCSEE system that uses the Forney formula (with inputs Λ(x) and Ω(x)), which uses one less full-multiplier, one less half-multiplier, and one less multiplexer.

In some applications, the latency from the cascade of the discrepancy computation block and error locator update block of rIBMM systems may be undesirable. When latency is not a concern, rIBMM embodiments may be desirable since they have lower hardware complexity compared to some other decoder systems. Some types of Berlekamp-Massey methods exist in which the discrepancy computation block and error locator update block are implemented in parallel so that low latency is achieved. Parallel inversionless Berlekamp-Massey methods that use improved methods may be preferred in some applications where latency is a concern.

Parallel Berlekamp-Massey methods perform discrepancy computation and polynomial updates simultaneously to reduce latency. In the Berlekamp-Massey method described in the IBMM example, the discrepancy value Δ^((r)) is computed based on the error locator polynomial Λ^((r))(x), which contributes to the high latency. In some types of parallel Berlekamp-Massey methods, discrepancies are generated iteratively so that they are processed in parallel to the update of the error locator polynomial.

A left-shift operator “L” of a polynomial is defined such that [

_(r) A](x)

[A(x)−(A(x) mod x ^(r))]/x ^(r)   (14) An alternative interpretation gives more insight. Let A=[A₀, A₁, A₂, . . . , A_(t)] be the vector representation of the polynomial A(x), then

_(r)A=[A_(r), A_(r+1), . . . , A_(t)].

The following block of example pseudo code iteratively generates the discrepancy values.

A pseudo code example of an Iterative Approach to Generate Discrepancy Values follows.

-   -   Input: S=[S₀, S₁, S₂, . . . , S_(2t−1)]     -   Initialization: {circumflex over (Ω)}⁽⁰⁾(x)=S(x), {circumflex         over (Θ)}⁽⁰⁾(x)=S(x), γ⁽⁰⁾=1, L=0     -   For r=0, 1, 2, . . . , 2t−1, do:         -   {circumflex over (Ω)}^((r+1))(x)=γ^((r))·[             {circumflex over (Ω)}^((r))](x)−{circumflex over (Ω)}₀             ^((r))·{circumflex over (Θ)}^((r))(x)         -   If {circumflex over (Ω)}₀ ^((r))≠0 and 2L≦r, then             -   Set {circumflex over (Θ)}^((r+1))(x)←[                 {circumflex over (Ω)}^((r))](x)             -   Set L←r+1−L             -   Set γ^((r+1))←{circumflex over (Ω)}₀ ^((r))         -   Else do NULL:             -   Set {circumflex over (Θ)}^((r+1))(x)←{circumflex over                 (Θ)}^((r))(x)             -   Set γ^((r+1))←γ^((r))         -   endif     -   endfor     -   Output: Δ=[{circumflex over (Ω)}₀ ⁽⁰⁾, {circumflex over (Ω)}₀         ⁽¹⁾, {circumflex over (Ω)}₀ ⁽²⁾, . . . , {circumflex over (Ω)}₀         ^((2t−1))]

{circumflex over (Ω)}^((r))(x) and {circumflex over (Θ)}^((r))(x) is a left-shifted polynomial of Λ^((r))(x)S(x) and B^((r))(x)S(x) respectively, more specifically, {circumflex over (Ω)}^((r))(x)=[

(Λ^((r)) S)](·x), {circumflex over (Θ)}^((r))(x)=[

(B ^((r)) S)](x),

where Λ^((r))(x) and B^((r))(x) denote the error locator polynomial couple generated during the r-th iteration of the Berlekamp-Massey method.

Modifications may be performed on the example iterative approach to generate discrepancy values, and Lemmas 5 and 6 are presented to characterize the modified iterative approach.

An embodiment of a Modified Iterative Approach to Generate Discrepancy Values follows.

-   -   Input: S=[S₀, S₁, S₂, . . . , S_(2t−1)]     -   Initialization: {circumflex over (Θ)}⁽⁰⁾(x)=S₀+S₁x+ . . .         +S_(2t−2)x^(2t−2), {circumflex over (Ω)}⁽⁰⁾(x)=S₀+S₁x+ . . .         +S_(2t−2)x^(2t−2)+S_(2t−1)x^(2t−1), γ⁽⁰⁾=1, L=0     -   For r=0, 1, 2, . . . , 2t−1, do:         -   {circumflex over (Ω)}^((r+1))(x)=γ^((r))·[             {circumflex over (Ω)}^((r))](x)−{circumflex over (Ω)}₀             ^((r))·{circumflex over (Θ)}^((r))(x)         -   If {circumflex over (Ω)}₀ ^((r))≠0 and 2L≦r, then             -   Set {circumflex over (Θ)}^((r+1))(x)←[                 {circumflex over (Ω)}^((r))](x)             -   Set L←r+1−L             -   Set γ^((r+1))←{circumflex over (Ω)}₀ ^((r))         -   Else do NULL:             -   Set {circumflex over (Θ)}^((r+1))(x)←{circumflex over                 (Θ)}^((r))(x)             -   Set γ^((r+1))←γ^((r))         -   endif         -   Set {circumflex over (Θ)}_(2t−r−2) ^((r+1))=0     -   endfor     -   Output: Δ=[{circumflex over (Ω)}₀ ⁽⁰⁾, {circumflex over (Ω)}₀         ⁽¹⁾, {circumflex over (Ω)}₀ ⁽²⁾, . . . , {circumflex over (Ω)}₀         ^((2t−1))]

Lemma 5

(i). {{circumflex over (Ω)}_(i) ^((r))}_(i=0) ^(2t−1−r) and {{circumflex over (Θ)}_(i) ^((r))}_(i=0) ^(2t−2−r), r=0, 1, 2, . . . , 2t, are intact.

(ii). The functionality of the above embodiment does not change.

Proof of (i): Part (i) is shown by induction. It is true for r=0. When r=1, by inspection {{circumflex over (Ω)}_(i) ⁽¹⁾}_(i=0) ^(2t−2) and {{circumflex over (Θ)}_(i) ⁽¹⁾}_(i=0) ^(2t−3), are intact, so the proposition holds for r=1 as well. Suppose it holds for r≦K and consider the case r=K+1. {circumflex over (Ω)}^((K+1))(x) is determined by {circumflex over (Ω)}^((K+1))(x)=γ^((K))·[

{circumflex over (Ω)}](x)={circumflex over (Ω)}₀ ^((K))·{circumflex over (Θ)}^((K))(x). Since γ^((K)) is a function of {circumflex over (Ω)}₀ ⁽⁰⁾, {circumflex over (Ω)}₀ ⁽¹⁾, . . . , {circumflex over (Ω)}₀ ^((K−1)), it is intact. Based on the assumption, {{circumflex over (Ω)}_(i) ^((K+1))}_(i=0) ^(2t−2−K) are intact. On the other hand, {circumflex over (Θ)}^((K+1))(x) is either [

{circumflex over (Ω)}^((K))](x) or {circumflex over (Θ)}^((K))(x), thus, again by the assumption, {{circumflex over (Θ)}_(i) ^((K+1))}_(i=0) ^(2t−3−K) are intact. Since {circumflex over (Θ)}_(2t−K−2) ^((K+1)) is not included in the set {{circumflex over (Θ)}_(i) ^((K+1))}_(i=0) ^(2t−3−K), none of its elements is reset to 0 during the (K+1)-th iteration. That is, the proposition also holds for the case r=K+1. Part (i) is thus proven.

Part (ii) is a corollary of Part (i). Lemma 5 is therefore proven.

Lemma 6

(i). The nonzero coefficients of {circumflex over (Ω)}(x) and {circumflex over (Θ)}(x) are limited along with 2t iterations to the shape of upper triangular. More specifically, {circumflex over (Ω)}_(2t−r−1) ^((r))={circumflex over (Ω)}_(2t−r) ^((r))=. . . ={circumflex over (Ω)}_(2t−1) ^((r))=0,   (15) {circumflex over (Θ)}_(2t−r−2) ^((r))={circumflex over (Θ)}_(2t−r−1) ^((r))=. . . ={circumflex over (Θ)}_(2t−1) ^((r))=0   (16) for r=1, 2, . . . , 2t

(ii). When the number of errors e<t, {circumflex over (Ω)}^((r))(x)=0,   (17) for r=2e, 2e+1, . . . , 2t.

Proof of (i): Part (i) can be shown by induction.

Proof of (ii): Λ^((2e))(x) contains the all error locations as its all roots. Consequently, [Δ^((2e)), Δ^((2e+1)), . . . , Δ^((2t−1))]=[{circumflex over (Ω)}₀ ^((2e)), {circumflex over (Ω)}₀ ^((2e+1)), . . . , {circumflex over (Ω)}₀ ^((2t))]=0. {circumflex over (Ω)}₀ ^((2e))=0 indicates that {circumflex over (Ω)}₀ ^((2e+1))=γ^((2e){circumflex over (Ω)}₁ ^((2e)), thus, {circumflex over (Ω)}₁ ^((2e))=0, and so forth, consequently {circumflex over (Ω)}₂ ^((2e))=0, {circumflex over (Ω)}₃ ^((2e))=0, . . . , {circumflex over (Ω)}_(2t−2e−2) ^((2e))=0 are obtained. In conjunction with Part (i), {circumflex over (Ω)}₂ ^((2e))(x)=0. Subsequently {circumflex over (Ω)}^((2e+1))(x)=0 is obtained, due to {circumflex over (Ω)}^((2e))(x)=0 and {circumflex over (Ω)}₀ ^((2e))=0, and so forth for {circumflex over (Ω)}^((r))(x)=0, r=2e+2, 2e+3, . . . , 2t. Part (ii) and Lemma 6 are thus proven.

As described above, to reduce latency the discrepancy values are generated iteratively in parallel to update of the error locator polynomial, B(x). A left-shifted Berlekamp-Massey update of the error locator polynomial given the discrepancy values is presented.

An example of a Left-shifted Inversionless Berlekamp-Massey Method with Known Discrepancies follows.

-   -   Input: Δ=[Δ⁽⁰⁾, Δ⁽¹⁾, Δ⁽²⁾, . . . , Δ^((2t−1))]     -   Initialization: Λ⁽⁰⁾(x)=B⁽⁰⁾(x)=x^(2t), γ⁽⁰⁾=1, L=0     -   For r=0, 1, 2, . . . , 2t−1, do:         -   Λ^((r+1))(x)=γ^((r))·[             Λ^((r))](x)−Δ^((r)) ·B ^((r))(x)         -   If Δ^((r))≠0 and 2L≦r, then             -   Set B^((r+1))(x)←[                 Λ^((r))](x)             -   Set L←r+1−L             -   Set γ^((r+1))←Δ^((r))         -   Else do NULL:             -   Set B^((r+1))(x)←B^((r))(x)             -   Set γ^((r+1))←γ^((r))         -   endif     -   endfor     -   Output: Λ=[Λ₀ ^((2t)), Λ₁ ^((2t)), Λ₂ ^((2t)), . . . , Λ_(t)         ^((2t))], γ=γ^((2t)), L B=[B₀ ^((2t)), B₁ ^((2t)), B₂ ^((2t)), .         . . , B_(2t−1) ^((2t))]

By inspection, the above pseudo code for the left-shifted inversionless Berlekamp-Massey method with known discrepancies may be merged with the pseudo code for an iterative approach to generate discrepancy values to generate a single complete method as follows.

A pseudo code embodiment of a Parallel Inversionless Berlekamp-Massey Method (PIBMM) follows.

-   -   Input: S=[S₀, S₁, S₂, . . . , S_(2t−1)]     -   Initialization: {circumflex over (Θ)}⁽⁰⁾(x)=S₀+S₁x+ . . .         +S_(2t−2)x^(2t−2)+x^(2t), γ⁽⁰⁾=1, L=0 {circumflex over         (Ω)}⁽⁰⁾(x)=S₀+S₁x+ . . .         +S_(2t−2)x^(2t−2)+S_(2t−1)x^(2t−1)+x^(2t)     -   For r=0, 1, 2, . . . , 2t−1, do:         -   {circumflex over (Ω)}^((r+1))(x)=γ^((r))·[             {circumflex over (Ω)}^((r))](x)−{circumflex over (Ω)}₀             ^((r))·{circumflex over (Θ)}^((r))(x)         -   If {circumflex over (Ω)}₀ ^((r))≠0 and 2L≦r, then             -   Set {circumflex over (Θ)}^((r+1))(x)←[                 {circumflex over (Ω)}^((r))](x)             -   Set L←r+1−L             -   Set γ^((r+1))←{circumflex over (Ω)}₀ ^((r))         -   Else do NULL             -   Set {circumflex over (Θ)}^((r+1))(x)←{circumflex over                 (Θ)}^((r))(x)             -   Set γ^((r+1))←γ^((r))         -   endif         -   Set {circumflex over (Θ)}_(2t−r−2) ^((r+1))=0     -   endfor     -   Output Λ=[{circumflex over (Ω)}₀ ^((2t)), {circumflex over (Ω)}₁         ^((2t)), {circumflex over (Ω)}₂ ^((2t)), . . . , {circumflex         over (Ω)}_(t) ^((2t))], γ=γ^((2t)), L B=[{circumflex over (Θ)}₀         ^((2t)), {circumflex over (Θ)}₁ ^((2t)), {circumflex over (Θ)}₂         ^((2t)), . . . , {circumflex over (Θ)}_(2t−1) ^((2t))], z

FIG. 4A is a processing diagram illustrating an embodiment of generation of discrepancy values. In the example shown, the x axis illustrates multipliers used, the y axis illustrates the time domain, and 6t+2 multipliers go through 2t iterations. Processing block 400 may be performing an iterative approach to generate discrepancy values. The shaded region of block 400 illustrates the multipliers used in each iteration to generate discrepancies. Syndromes are input to processing block 400 and discrepancy values are output. At the first iteration, processing block 400 uses 4t multipliers. During the iterative process, the number of multipliers used by processing block 400 gradually decreases. At the last iteration, processing block 400 uses 2t multipliers.

Processing block 402 performs the left-shifted inversionless Berlekamp-Massey method with known discrepancies. Discrepancy values are passed to processing block 402 and the error locator polynomial, Λ(x), and the scratch polynomial, B(x) are output. The number of multipliers used gradually increases from 0 multipliers at the first iteration to 2t multipliers at the last iteration.

FIG. 4B is a processing diagram illustrating an embodiment of the parallel inversionless Berlekamp-Massey method. In the example shown, 4t+2 multipliers go through 2t iterations. Processing block 450 generates syndromes using a modified iterative approach to generate discrepancy values. Syndromes are input to processing block 450 and syndrome values are output. The number of multipliers used by processing block 450 gradually decreases from 4t multipliers during the first cycle to 0 multipliers during the last cycle.

Processing block 452 generates the error locator polynomial, Λ(x), and the scratch polynomial, B(x). The left-shifted inversionless Berlekamp-Massey method with known discrepancies may be used by processing block 452. The number of multipliers used by processing block 452 gradually increases from 2 multipliers to 2t multipliers.

As illustrated, using the parallel inversionless Berlekamp-Massey method may enable less multipliers in a decoders. Rather than instantiating 6t+2 multipliers, 4t+2 multipliers may be instantiated.

In some embodiments, the degree of B(x) is limited to t−1. To do so, an auxiliary criterion (set {circumflex over (Θ)}^((r+1))(x)←[

{circumflex over (Θ)}^((r))](x) when L_(B)≧t−1) is introduced and a separate loop logic z is utilized to accumulate the unknown α^(−(t+−2)) used in the error evaluation (refer to Lemma 4). That is, the degree of the scratch polynomial, B(x), is limited to t−1 by shifting out zero roots. In addition, condition checking in the control unit can be significantly simplified by tracking the degree of B(x). A revised method with the degree of B(x) limited to t−1 is described below.

A pseudo code embodiment of Revised Parallel Inversionless Berlekamp-Massey Method (rPIBMM) follows.

-   -   Input: S=[S₀, S₁, S₂, . . . , S_(2t−1)]     -   Initialization: {circumflex over (Θ)}⁽⁰⁾(x)=S₀+S₁x+ . . .         +S_(2t−2)x^(2t−2)+x^(2t), γ⁽⁰⁾=1, L_(Λ)=L_(B)=0 {circumflex over         (Θ)}⁽⁰⁾(x)=S₀+S₁x+ . . .         +S_(2t−2)x^(2t−2)+S_(2t−1)x^(2t−1)+x^(2t), z=1     -   For r=0, 1, 2, . . . , 2t−1, do:         -   {circumflex over (Ω)}^((r+1))(x)=γ^((r))·[             {circumflex over (Ω)}^((r))](x)−{circumflex over (Ω)}₀             ^((r))·{circumflex over (Θ)}^((r))(x)         -   If {circumflex over (Ω)}₀ ^((r))≠0 and 2L≦r, then             -   Set {circumflex over (Θ)}^((r+1))(x)←[                 {circumflex over (Ω)}^((r))](x)             -   Set L_(Λ)←L_(B)+1, L_(B)←L_(Λ)             -   Set γ^((r+1))←{circumflex over (Ω)}₀ ^((r)), z←z·α⁻¹         -   Else             -   Set γ^((r+1))←γ^((r))             -   If L_(B)≧t−1, then set {circumflex over                 (Θ)}^((r+1))(x)←[                 {circumflex over (Θ)}^((r))](x)             -   Else set {circumflex over (Θ)}^((r+1))(x)←{circumflex                 over (Θ)}^((r))(x), z←z·α⁻¹, L_(B)←L_(B)+1         -   endif         -   Set {circumflex over (Θ)}_(2t−r−2) ^((r+1))=0     -   endfor     -   Output: Λ=[{circumflex over (Ω)}₀ ^((2t)), {circumflex over         (Ω)}₁ ^((2t)), {circumflex over (Ω)}₂ ^((2t)), . . . ,         {circumflex over (Ω)}_(t) ^((2t))], γ=γ^((2t)), L B=[{circumflex         over (Θ)}₀ ^((2t)), {circumflex over (Θ)}₁ ^((2t)), {circumflex         over (Θ)}₂ ^((2t)), . . . , {circumflex over (Θ)}_(t−1)         ^((2t))], z

Lemma 5 ensures the properness of the illustrated PIBMM and rPIBMM embodiments. Moreover, the PIBMM and rPIBMM embodiments may be power efficient, as indicated by Lemma 6. For example, when e<t (where e is the number of erros), after 2e iterations, the update logic {circumflex over (Ω)}^((r+1))(x)=γ^((r))·[

{circumflex over (Ω)}^((r))](x)−{circumflex over (Ω)}₀ ^((r))·{circumflex over (Θ)}^((r))(x) where r≧2e, invokes e+1 multipliers (which are associated with Λ(x)), while the remaining 4t+1−e multipliers may be disabled. Besides this, the method acts as a shift register array.

In some embodiments, modular architectures that implement components of decoders may be preferred over systems that are not modular. A modular system may instantiate the same block multiple times, whereas a non-modular system may instantiate different modules that perform similar functionality. Modular systems in some applications may be preferred because modular systems may scale easily (for example, expanding or contracting to change t, the error correction capability) or may enable more compact systems (for example, the placement and routing of a reused module may be optimized and reused with each instantiation).

FIG. 5A is a diagram illustrating a modular PIBMM system. In the example shown, the illustrated system may perform the example pseudo code of the parallel inversionless Berlekamp-Massey method. System 500 is modular and devices 502-507 may be different instantiations of the same module. Each of processor elements (PE) 502-507 generates both a value of the error locator polynomial, Λ_(i), and a value of the error update polynomial, B_(i).

FIG. 5B is a diagram illustrating a processor element (PE) used in a PIBMM system. In the example shown, the illustrated PE element may be instantiated in a modular PIBMM system. Orientations of inputs and outputs correspond to orientations of inputs and outputs in FIG. 4A. Outputs Λ₀ and B₀ of PE 502 (and similar outputs for PE 503-507) correspond to outputs {circumflex over (Ω)}_(i) ^((r)) and {circumflex over (Θ)}_(i) ^((r+1)), respectively. Other inputs and outputs of PE 450 also match corresponding inputs and outputs of PE 502-507.

FIG. 6A is a diagram illustrating a modular rPIBMM system. In the example shown, the illustrated system may perform the example pseudo code of the revised parallel inversionless Berlekamp-Massey method. System 600 is modular and devices 602-607 may be different instantiations of the same module. Note that the control signals of rPIBMM system 600 vary slightly from that of PIBMM system 400. A third control signal MC3 is used by rPIBMM system 600 in addition to MC1 and MC2.

FIG. 6B is a diagram illustrating a processor element (PE) used in an rPIBMM system. In the example shown, the illustrated PE element may be instantiated in a modular rPIBMM system. Orientations of inputs and outputs correspond to orientations of inputs and outputs in FIG. 6A. PE 650 uses a third control signal MC3 to control multiplexer 652. PE 550 does not include MC3 as an input and does not have a multiplexer that corresponds to multiplexer 652.

FIGS. 5A and 6A contain an array of 2t+1 homogeneous processor elements (PE). The control signal MC1 represents the Boolean operation “Ω^((r))≠0 and 2r≦L”. There are a variety of ways to implement {circumflex over (Θ)}_(2t−r−2) ^((r+1))=0, r=0, 1, 2, . . . 2t−1. Herein, a 2t-dimension unit vector with the only one initially set to the right-most position is used. In each iteration, the element {circumflex over (Θ)}_(i) is set to 0 if its index i corresponds to the one in that binary vector and the one is then left-shifted by one bit (its control signal is denoted by MC2).

PE 650 used in the rPIBMM architecture uses one more level of multiplexing than that of PE 550 used in the PIBMM architecture, but is similar otherwise. The control signal MC3 represents the Boolean operation “r−L<t−1”.

The rPIBMM architecture of system 600 may be coupled to a rPCSEE system. Each PE 650 of the rPIBMM architecture contains two multipliers, one adder, three multiplexes, and two registers. Ignoring control unit 610 (which may be negligible compared to the rest of system 600) the rPIBMM architecture uses 2t+1 adders, 4t+2 multipliers, 4t+2 registers, and 6t+3 multiplexers.

The critical path delay of the illustrated rPIBMM system is caused by one multiplication and one addition in updating {circumflex over (Ω)}^((r))(x), i.e., T _(crit-path) =T _(mult) +T _(add).   (18)

The multiplex operations are used in updating {circumflex over (Θ)}^((r))(x) and thus do not affect the critical path delay. In comparison to the rIBMM architecture, the rPIBMM architecture significantly shortens the critical path delay from 2T_(mult)+(1+┌log₂(t+1)┐)·T_(add) to T_(mult)+T_(add), which is used for the error locator update.

FIG. 7 is a table illustrating implementation costs and critical path delays of some embodiments of methods used in Reed Solomon decoding. In the example shown, the illustrated methods solve equation 4 in 2t clock cycles (i.e., their outputs may be directly pipelined to the processor of the Chien search and error evaluation). In some applications, if longer delay is allowed, then essentially each PE of a modular architecture may be repeatedly used and hardware complexity may be reduced. For example, the extended Euclidean method (EEM) may be implemented in a folded fashion such that the hardware complexity is reduced to roughly a quarter but the number of clocks is increased by five times. The IBMM is implemented serially so that three multipliers are employed.

The rIBMM and IBMM systems have similar architectures that include a discrepancy computation block and an error locator update block, and the cascade of the two contributes to the critical path delay. The rIBMM uses the least hardware of the architectures illustrated in the table, but has more than twice the critical path delay compared to parallel methods including rPIBMM, PIBMM, and EEM.

The rPIBMM and PIBMM systems have similar architectures, both employing inversionless Berlekamp-Massey iteration. The rPIBMM improves upon the PIBMM by reducing the hardware used while maintaining a critical path delay of T_(mult)+T_(add). The PEs in the two architectures are similar except that the rPIBMM PE has two additional multiplexers. However, the rPIBMM architecture employs t less PEs than the PIBMM system. Some embodiments of the PIBMM may not be scalable, as the beginning position of one of its outputs ({circumflex over (Ω)}(x)) is dependent upon t, while the beginning position of the outputs of the rPIBMM embodiment is not dependant upon t. EMM also exhibits regular and scalable architecture. However, the EEM architecture may use twice as much as hardware as an rPIBMM embodiment.

Various embodiments of Reed-Solomon decoder architectures are disclosed. By enforcing a dynamic stopping rule over the conventional inversionless Berlekamp-Massey method, an rIBMM embodiment is obtained. The described rIBMM embodiment uses less hardware compared to some other architectures and may be pipelined to an embodiment of a rPCSEE processor (which is comparable to the PCSEE utilizing the Forney formula), eliminating t cycles of computing the error evaluator polynomial. The rIBMM embodiment may be power efficient by dynamically terminating. In addition, the illustrated rIBMM embodiment incorporates a stopping criteria, e.g., terminates the method after a given number of consecutive zero discrepancies. However, in some applications the latency of the rIBMM embodiment may be undesirable.

In applications where latency is a concern, the example parallel inversionless Berlekamp-Massey method and embodiment of the rPIBMM architecture that achieves the desirable low latency may be preferred over the rIBMM embodiment. The rPIBMM embodiment uses 4t+2 multipliers and registers, which may be less hardware than other low-latency decoder architectures, and may dynamically disable multipliers and adders when they are not used.

Although specific embodiments and examples are presented, the concepts and methods may be applied to other methods and architectures. Additional optimization may also be performed. For example, in some embodiments the rPIBMM architecture is pipelined to reduce the latency further.

Although the foregoing embodiments have been described in some detail for purposes of clarity of understanding, the invention is not limited to the details provided. There are many alternative ways of implementing the invention. The disclosed embodiments are illustrative and not restrictive. 

1. A method of processing Reed Solomon data, including: generating, at a processor, a degree limited scratch polynomial having a degree that is limited to a defined value using an inversionless Berlekamp-Massey process, wherein generating includes shifting out at least one zero root in a polynomial being operated on in the event the degree of the polynomial being operated on exceeds the defined value, wherein the defined value is t−1 and t is an error correction capability of a code used to generate the Reed Solomon data; and determining a magnitude of an error associated with the Reed Solomon data using the processor based at least in part on information associated with the degree limited scratch polynomial.
 2. A system for processing Reed Solomon data, including a processor configured to: obtain generate a degree limited scratch polynomial having a degree that is limited to a defined value using an inversionless Berlekamp-Massey process, wherein generating includes shifting out at least one zero root in a polynomial being operated on in the event the degree of the polynomial being operated on exceeds the defined value, wherein the defined value is t−1 and t is an error correction capability of a code used to generate the Reed Solomon data; and determine a magnitude of an error associated with the Reed Solomon data based at least in part on information associated with the degree limited scratch polynomial; and a memory configured to be accessible to the processor.
 3. The system as recited in claim 2, wherein the processor includes a plurality of devices and each of the plurality of devices is configured to generate (1) a coefficient of the scratch polynomial and (2) a coefficient of an error locator polynomial.
 4. The system as recited in claim 2, wherein the processor includes a plurality of devices and each of the plurality of devices has the same structure.
 5. The system as recited in claim 2, wherein the processor includes a plurality of devices and the number of the plurality of devices varies in accordance with an error correction capability.
 6. The system as recited in claim 2, wherein limiting the degree of the scratch polynomial allows at least one configuration with fewer components compared to a system in which the degree of the scratch polynomial is not limited.
 7. The system as recited in claim 2, wherein the processor is further configured to perform a Chien search.
 8. The system as recited in claim 2, wherein at least one zero root is not removed from the scratch polynomial.
 9. The system as recited in claim 2, wherein the processor is further configured to obtain a syndrome polynomial.
 10. The system as recited in claim 2, wherein the processor is further configured to determine a location of the error.
 11. The system as recited in claim 2, wherein the processor is further configured to obtain roots of an error locator polynomial.
 12. The system as recited in claim 2, wherein the processor is further configured to determine a location of the error, including using a Chien search.
 13. The system as recited in claim 2 wherein information associated with an error evaluator polynomial is not used in determining the magnitude.
 14. The system as recited in claim 2, wherein the processor is further configured to obtain an error locator polynomial.
 15. The system as recited in claim 2, wherein the processor is further configured to obtain an error locator polynomial, including by suing an iterative process.
 16. The system as recited in claim 2, wherein the processor is further configured to obtain an error locator polynomial, including by using an iterative process such that the iterative process is stopped in the event a criterion associated with an error correction capability is satisfied.
 17. The system as recited in claim 2, wherein the inversionless Berlekamp-Massey process includes simultaneously performing at least a portion of processing associated with discrepancy computation and at least a portion of processing associated with error locator update.
 18. The system as recited in claim 2, wherein the processor is further configured to perform a Chien search, wherein at least part of the Chien search and at least part of determining the magnitude of the error are performed simultaneously.
 19. The system as recited in claim 2, wherein the Reed Solomon data is obtained from a storage device.
 20. A computer program product for processing Reed Solomon data, the computer program product being embodied in a computer readable storage medium and comprising computer instructions for: generating a degree limited scratch polynomial having a degree that is limited to a defined value using an inversionless Berlekamp-Massey process, wherein generating includes shifting out at least one zero root in a polynomial being operated on in the event the degree of the polynomial being operated on exceeds the defined value, wherein the defined value is t−1 and t is an error correction capability of a code used to generate the Reed Solomon data; and determining a magnitude of an error associated with the Reed Solomon data based at least in part on information associated with the degree limited scratch polynomial. 